Role of adjacency-matrix degeneracy in maximum-entropy-weighted network models
نویسندگان
چکیده
منابع مشابه
Reducing degeneracy in maximum entropy models of networks.
Based on Jaynes's maximum entropy principle, exponential random graphs provide a family of principled models that allow the prediction of network properties as constrained by empirical data (observables). However, their use is often hindered by the degeneracy problem characterized by spontaneous symmetry breaking, where predictions fail. Here we show that degeneracy appears when the correspondi...
متن کاملMaximum Entropy Analysis of Queueing Network Models
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of tree expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuoustime and discrete-time Queu...
متن کاملAssessment of Artificial Neural Network Models and Maximum Entropy in Zoning of Gully Erosion Sensitivity of Golestan Dam Basin
Zoning of gully erosion susceptibility and determining the factors controlling gully erosion is very important and vital. The aim of this study was to investigate the spatial distribution of gully erosion using two models of ANN and MaxEnt and to determine the factors affecting this type of erosion in Golestan Dam basin. Therefore, 14 factors in the form of three divisions, including topographi...
متن کاملAdjacency Matrix Based Full-Text Indexing Models
With the rapid growth of online text information and user accesses, query-processing efficiency has become the major bottleneck of information retrieval (IR) systems. This paper proposes two new full-text indexing models to improve query-processing efficiency of IR systems. By using directed graph to represent text string, the adjacency matrix of text string is introduced. Two approaches are pr...
متن کاملDrawing Weighted Directed Graph from It's Adjacency Matrix
This paper proposes an algorithm for buUdmg weighted directed graph,defmes the weighted directed relationship matrix of the graph,an d describes algorithm implementation using this matrix.Based on this algorithm ,an effective way for building an d drawing weighted directed graphs is presented,forming a foundation for visual implementation of the algorithm in the graph theory.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2015
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.92.052816